Preconditioner Construction with Rational Approximation

نویسندگان

  • Mo Mu
  • John R. Rice
چکیده

AbRtract This paper deals with the domain decomposition-based preconditioned conjugate gradient method. The Schur complement is expressed as a function of & simple interface matrix. This function is approximated by a simple rational function to generate a simple matrix that is then used 8.8 & preconditioner for the Schur complement. Extensive experiments are performed to examine the effectiveness and efficiency of this approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Rational Function Preconditioner For Indefinite Sparse Linear Systems

This paper introduces a rational function preconditioner for linear systems with indefinite sparse matrices A. By resorting to rational functions of A, the algorithm decomposes the spectrum of A into two disjoint regions and approximates the restriction of A−1 on these regions separately. We show a systematic way to construct these rational functions so that they can be applied stably and inexp...

متن کامل

A Wide-Angle Full-Vector Beam Propagation Method Based on an ADI Preconditioner

Wide-angle full-vector Beam Propagation Methods (BPMs) for three dimensional wave-guiding structures can be derived based on rational approximants of a square root operator or its exponential (i.e. the one-way propagator). While the less accurate BPM based on the slowly varying envelope approximation can be efficiently solved by the Alternating Direction Implicit (ADI) method, the wide-angle va...

متن کامل

Hierarchical Matrix Approximation for Kernel-Based Scattered Data Interpolation

Scattered data interpolation by radial kernel functions leads to linear equation systems with large, fully populated, ill-conditioned interpolation matrices. A successful iterative solution of such a system requires an efficient matrix-vector multiplication as well as an efficient preconditioner. While multipole approaches provide a fast matrix-vector multiplication, they avoid the explicit set...

متن کامل

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

Approximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices

A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993